Minimum Spanning Tree Method for Sparse Graphs

The minimum spanning tree (MST) is widely used in planning the most economical network. algorithm for finding MST of a connected graph essential. In this paper, new proposed based on deduced theorem MST. first sorts edges according to their weight, from large small. Next, premise ensuring connectivity graph, it deletes order until number equal vertexes minus 1. Finally, remaining an This equivalent inverse Kruskal algorithm. For sparse graphs, has higher efficiency than Experiments and analysis verify effectiveness paper. provides better choice graph.